Lifting Gomory cuts with bounded variables

Recently, Balas and Qualizza introduced a new cut for mixed 0,1 programs, called lopsided cut. Here we present a family of cuts that comprises the Gomory mixed integer cut at one extreme and the lopsided cut at the other. We show that every inequality in this family is extreme for the appropriate infinite relaxation. We also show that these inequalities are split cuts. Finally we provide computational results.